Uniformly Recurrent Subgroups

نویسندگان

  • ELI GLASNER
  • BENJAMIN WEISS
چکیده

We define the notion of uniformly recurrent subgroup, URS in short, which is a topological analog of the notion of invariant random subgroup (IRS), introduced in [2]. Our main results are as follows. (i) It was shown in [26] that for an arbitrary countable infinite group G, any free ergodic probability measure preserving G-system admits a minimal model. In contrast we show here, using URS’s, that for the lamplighter group there is an ergodic measure preserving action which does not admit a minimal model. (ii) For an arbitrary countable group G, every URS can be realized as the stability system of some topologically transitive G-system.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Uniformly Recurrent Subgroups of Simple Locally Finite Groups

We study the uniformly recurrent subgroups of simple locally finite groups.

متن کامل

Uniformly Recurrent Subgroups of Inductive Limits of Finite Alternating Groups

We classify the uniformly recurrent subgroups of inductive limits of finite alternating groups.

متن کامل

Symbolic Dynamics in Free Profinite Semigroups

This is a survey and announcement of recent results on the structure of free profinite semigroups using techniques and results from symbolic dynamics. The intimate connection between uniformly recurrent infinite words and J -maximal regular J -classes is explored to compute the maximal subgroups of the J -classes associated with Arnoux-Rauzy infinite words, which turn out to be free profinite g...

متن کامل

On Uniform Recurrence of a Direct Product

The direct product of two words is a naturally defined word on the alphabet of pairs of symbols. An infinite word is uniformly recurrent if each its subword occurs in it with bounded gaps. An infinite word is strongly recurrent if the direct product of it with each uniformly recurrent word is also uniformly recurrent. We prove that fixed points of the expanding binary symmetric morphisms are st...

متن کامل

On Uniformly Recurrent Morphic Sequences

In the paper we mainly deal with two well-known types of in nite words: morphic and uniformly recurrent (=almost periodic). We discuss the problem of nding criterion of uniform recurrence for morphic sequences and give e ective polynomial-time such criterion in two particular cases: pure morphic sequences and automatic sequences. We also prove that factor complexity of arbitrary uniformly recur...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014